Error of the two-step BDF for the incompressible Navier-Stokes problem
نویسندگان
چکیده
منابع مشابه
Error of the Two-step Bdf for the Incompressible Navier-stokes Problem
The incompressible Navier-Stokes problem is discretized in time by the two-step backward differentiation formula. Error estimates are proved under feasible assumptions on the regularity of the exact solution avoiding hardly fulfillable compatibility conditions. Whereas the time-weighted velocity error is of optimal second order, the time-weighted error in the pressure is of first order. Subopti...
متن کاملA Posteriori Error Estimation for the Fractional Step Theta Discretization of the Incompressible Navier-Stokes Equations
In this work, we derive a goal-oriented a posteriori error estimator for the error due to time discretization. As time discretization scheme we consider the fractional step theta method, that consists of three subsequent steps of the one-step theta method. In every sub-step, the full incompressible system has to be solved (in contrast to time integrators of operator splitting type). The resulti...
متن کاملNumerical Solution Techniques for the Steady Incompressible Navier-Stokes Problem
In this paper we discuss some recently published preconditioners for the incompressible Navier-Stokes equations. In combination with Krylov subspace methods, they give a fast convergence for the solution of the Navier -Stokes equations. With the help of numerical experiments, we report some new findings regarding the convergence of these preconditioners. Besides that, a renumbering scheme for d...
متن کاملPreconditioners for the Steady Incompressible Navier-Stokes Problem
In this paper we discuss preconditioners for the incompressible Navier-Stokes equations. In combination with Krylov subspace methods, they give a fast convergence for the solution of the Navier -Stokes equations. With the help of numerical experiments, we report some new findings regarding the convergence of these preconditioners. Besides that, a renumbering scheme for direct solvers and ILU pr...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2004
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an:2004037